Search for: All records

Low-fidelity engineering wake models are often combined with linear superposition laws to predict wake velocities across wind farms under steady atmospheric conditions. While convenient for wind farm planning and long-term performance evaluation, such models are unable to capture the time-varying nature of the waked velocity field, as they are agnostic to the complex aerodynamic interactions among wind turbines and the effects of atmospheric boundary layer turbulence. To account for such effects while remaining amenable to conventional system-theoretic tools for flow estimation and control, we propose a new class of data-enhanced physics-based models for the dynamics of wind farm flow fluctuations. Our approach relies on the predictive capability of the stochastically forced linearized Navier–Stokes equations around static base flow profiles provided by conventional engineering wake models. We identify the stochastic forcing into the linearized dynamics via convex optimization to ensure statistical consistency with higher-fidelity models or experimental measurements while preserving model parsimony. We demonstrate the utility of our approach in completing the statistical signature of wake turbulence in accordance with large-eddy simulations of turbulent flow over a cascade of yawed wind turbines. Our numerical experiments provide insight into the significance of spatially distributed field measurements in recovering the statistical signature of wind farm turbulence and training stochastic linear models for short-term wind forecasting. 

Several problems in modeling and control of stochastically-driven dynamical systems can be cast as regularized semi-definite programs. We examine two such representative problems and show that they can be formulated in a similar manner. The first, in statistical modeling, seeks to reconcile observed statistics by suitably and minimally perturbing prior dynamics. The second seeks to optimally select a subset of available sensors and actuators for control purposes. To address modeling and control of large-scale systems we develop a unified algorithmic framework using proximal methods. Our customized algorithms exploit problem structure and allow handling statistical modeling, as well as sensor and actuator selection, for substantially larger scales than what is amenable to current general-purpose solvers. We establish linear convergence of the proximal gradient algorithm, draw contrast between the proposed proximal algorithms and alternating direction method of multipliers, and provide examples that illustrate the merits and effectiveness of our framework. 

— In large-scale and model-free settings, first-order algorithms are often used in an attempt to find the optimal control action without identifying the underlying dynamics. The convergence properties of these algorithms remain poorly understood because of nonconvexity. In this paper, we revisit the continuous-time linear quadratic regulator problem and take a step towards demystifying the efficiency of gradient-based strategies. Despite the lack of convexity, we establish a linear rate of convergence to the globally optimal solution for the gradient descent algorithm. The key component of our analysis is that we relate the gradient-flow dynamics associated with the nonconvex formulation to that of a convex reparameterization. This allows us to provide convergence guarantees for the nonconvex approach from its convex counterpart.